Strictly Deterministic Sampling Methods in Computer Graphics
نویسنده
چکیده
We introduce a strictly deterministic, meaning non-random, rendering method, which performs superior to state of the art Monte Carlo techniques. Its simple and elegant implementation on parallel computer architectures is capable of simulating anti-aliasing, motion blur, depth of field, area light sources, glossy reflection and transmission, participating media, and global illumination. We provide a self-contained exposition of the underlying mathematical principles and illustrate how the design of quasi-Monte Carlo algorithms, i.e. strictly deterministic sampling methods based on number theory, is related to Monte Carlo algorithms based on probability theory.
منابع مشابه
Chapter 1 Quasi - Monte Carlo Sampling
In Monte Carlo (MC) sampling the sample averages of random quantities are used to estimate the corresponding expectations. The justification is through the law of large numbers. In quasi-Monte Carlo (QMC) sampling we are able to get a law of large numbers with deterministic inputs instead of random ones. Naturally we seek deterministic inputs that make the answer converge as quickly as possible...
متن کاملA statistical framework for comparing importance sampling methods , and an application to rectangular lights
Figure 1: Three of the 8 scene geometries analyzed to estimate IE ⇢-expectation over pixel space. The rest are shown in figure 4. 1 Abstract Importance sampling methods for ray tracing are numerous. One reason is due to the lack of a robust, quantitative method for comparison. This tech memo takes strides to provide a framework for comparing sampling methods on fair ground. We define a simple, ...
متن کاملDeterministic Blue Noise Sampling by Solving Largest Empty Circle Problems
〈Summary〉 Sampling patterns with a blue noise distribution are widely used in many areas of computer graphics, yet their efficient generation remains a difficult problem. We propose a method to generate point sets with a blue noise distribution using a deterministic algorithm with no preprocessing. We insert each new sample at the center of the largest empty circle in the point set, which is ob...
متن کاملPractical and efficient geometric ε - approximations ∗
We adapt an algorithm for computing a deterministic sample in a set system to compute εapproximations for certain geometric set systems. We give algorithms to evaluate the quality of our samples. Our implementation shows that our deterministic samples, although more costly to obtain, significantly outperform random samples in quality. These implementations may have utility in computer graphics ...
متن کاملPractical and Efficient Geometric Epsilon-Approximations
We adapt an algorithm for computing a deterministic sample in a set system to compute εapproximations for certain geometric set systems. We give algorithms to evaluate the quality of our samples. Our implementation shows that our deterministic samples, although more costly to obtain, significantly outperform random samples in quality. These implementations may have utility in computer graphics ...
متن کامل